ZRESTORE: A Link Restoration Scheme with High Aggregation and No Reservation
نویسندگان
چکیده
Abstract This paper proposes a new link restoration scheme for optical networks. Our scheme uses dynamic provisioning of bypass routes to effectively utilize bandwidth for restoration. The bypasses are pre-selected but not reserved. Bandwidth is requested in aggregate, resulting in control traffic savings. A unique idea of over-protecting channels on the links for future work savings has been proposed in this paper. Our scheme assumes the knowledge of global topology (but not capacity) information at each node. Using simulation results we show that our scheme is very competitive in terms of restoration times and restorability even in very high load conditions.
منابع مشابه
Performance Evaluation of Optical Mesh Restoration Schemes
This paper investigates the performance of various schemes for restoration of lightpaths in an optical mesh network. We consider schemes in which backup paths for links or paths are pro-computed, but wavelength assignment is either pro-computed (static) or done dynamically upon failure (dynamic). In static restoration we compare the performance of link and path restoration in terms of capacity ...
متن کاملEnhancing TCP splitting in satellite-terrestrial networks via ACK reservation
In this paper, we focus on the performance of TCP splitting in satellite-terrestrial hybrid networks. By simulation we show that long-time link outage has great negative impact on TCP throughput. To solve the problem, an ACK reservation scheme is proposed to speed up TCP recovery from link outage and analytical estimate of a key parameter of the scheme is provided for achieving high end-to-end ...
متن کاملEfficient channel reservation for backup paths in optical mesh networks
In an optical mesh network, backup channels are shared between multiple lightpaths to reduce restoration capacity overhead. The sharability of channels is usually constrained by the mandate to provide 100% recovery of all lightpaths affected by any single event failure in the network. This paper proposes a pool based channel reservation scheme that is optimal when the set of primary and backup ...
متن کاملDecentralized Local Backup LSP Calculation with Efficient Bandwidth Sharing
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS [1] (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is designed to protect traffic with strong delay requirements such as EF (Expedited Forwarding) ordered aggregates in a DiffServ domain. For this type of application endto-end recovery schemes are usually considered t...
متن کاملComparative Evaluation of Two Scalable QoS Architectures
This paper performs a comparative evaluation of two QoS architectures, RSVP Reservation Aggregation and Scalable ReservationBased QoS, aimed at providing QoS levels similar to the ones provided by the well-known RSVP/IntServ architecture, but scalable enough for use in high traffic core networks. The comparative analysis, based on each model’s characteristics and on simulation results, shows th...
متن کامل